Redundancy in logic III: Non-monotonic reasoning
نویسندگان
چکیده
منابع مشابه
Redundancy in Logic III: Non-Mononotonic Reasoning
We study the redundancy of circumscriptive and default theories, in particular regarding the complexity of establishing whether a given theory is redundant.
متن کاملProlegomena to Logic Programming for Non-monotonic Reasoning Prolegomena to Logic Programming for Non{monotonic Reasoning
The present prolegomena consist, as all indeed do, in a critical discussion serving to introduce and interpret the extended works that follow in this book. As a result, the book is not a mere collection of excellent papers in their own specialty, but provides also the basics of the motivation, background history, important themes, bridges to other areas, and a common technical platform of the p...
متن کاملNon-Monotonic Reasoning with Logic Programming
Our purpose is to exhibit a modular systematic method of representing non{ monotonic reasoning problems with the Well Founded Semantics WFS of extended logic programs augmented with eXplicit negation (WFSX), augmented by its Contradiction Removal Semantics (CRSX) when needed. We apply this semantics, and its contradiction removal semantics counterpart, to represent non-monotonic reasoning probl...
متن کاملNoMoRe : Non-monotonic Reasoning with Logic Programs
The non-monotonic reasoning system noMoRe [2] implements answer set semantics for normal logic programs. It realizes a novel, rule-based paradigm to compute answer sets by computing non-standard graph colorings of the block graph associated with a given logic program (see [6, 8, 7] for details). These non-standard graph colorings are called a-colorings or application-colorings since they reflec...
متن کاملExecutable Temporal Logic for Non-Monotonic Reasoning
In this paper we view nonmonotonic reasoning as a (special kind of) process. As temporal logic is a common formalism to specify and derive properties of processes, we introduce a variant of temporal logic as a general specification language for reasoning processes. We show that it is possible to execute finite specifications in this language, which leads to executability of a large class of fin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2008
ISSN: 0004-3702
DOI: 10.1016/j.artint.2008.02.003